GRAPHICAL ARRANGEMENTS OF COMPRESSED GRAPHS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Graphs and Arrangements

Preface The body of this text is written. It remains to find some words to explain what to expect in this book. A first attempt of characterizing the content could be: In words: The questions posed and partly answered in this book are from the intersection of graph theory and discrete geometry. The reader will meet some graph theory with a geometric flavor and some combinatorial geometry of the...

متن کامل

Monotonic Arrangements of Undirected Graphs

The problem of finding a path in a network each edge of which is at least as long as the previous edge has attracted some attention in recent years. For example, problem 10 of the 2008 American Invitational Mathematics Exam asked a variation of this problem, namely to find the number of paths of maximal length in the 4× 4 rectangular grid of dots such that the edge length strictly increases fro...

متن کامل

Supersolvability and Freeness for ψ-Graphical Arrangements

Let G be a simple graph on the vertex set {v1, . . . , vn} with edge set E. Let K be a field. The graphical arrangement AG in K n is the arrangement xi − xj = 0, vivj ∈ E. An arrangement A is supersolvable if the intersection lattice L(c(A)) of the cone c(A) contains a maximal chain of modular elements. The second author has shown that a graphical arrangement AG is supersolvable if and only if ...

متن کامل

Graphical Models Concepts in Compressed Sensing

This paper surveys recent work in applying ideas from graphical models and message passing algorithms to solve large scale regularized regression problems. In particular, the focus is on compressed sensing reconstruction via l1 penalized least-squares (known as LASSO or BPDN). We discuss how to derive fast approximate message passing algorithms to solve this problem. Surprisingly, the analysis ...

متن کامل

Planar Linear Arrangements of Outerplanar Graphs

Given an n -vertex outerplanar graph G I we consider the problem of arranging the vertices of G on a line such that no two edges cross and various cost measures are minimized. We present efficient algorithms for generating layouts in which every edge (i ,j) of G does not exceed a given bandwidth b (i ,n, the total edge length and the cutwidth of the layout is minimized. respectively. We present...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Honam Mathematical Journal

سال: 2014

ISSN: 1225-293X

DOI: 10.5831/hmj.2014.36.1.85